Fibonacci Heaps Revisited

Pairing Heaps are Sub - optimalbyMichael

Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjoy log n amortized costs for the standard heap operations. Although it has not been veri ed that pairing heaps perform the decrease key operation in constant amortized time, this has been conjectured and extensive experimental evidence supports this conjecture. Moreover, pairing heaps have been ob...

Resolving a Question about Randomized Fibonacci Heaps in the Negative

In this project, we study a randomized variant of Fibonacci heaps where instead of using mark bits, one flips coins in order to determine whether to cascade bringing nodes into the root list. Although it seems intuitive that such heaps should have the same expected performance as standard Fibonacci heaps—and Karger has conjectured as such—the only previous work was an O(log s) upper bound using...

Relaxed Fibonacci heaps: An alternative to Fibonacci heaps with worst case rather than amortized time bounds

Improved Upper Bounds for Pairing Heaps

Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing heaps have the same amortized runtimes as Fibonacci heaps for all operations but Decrease-Key.

Relaxed Fibonacci heaps : An alternative to Fibonacci heaps with worst case rather than amortized time bounds ∗ Chandrasekhar

We present a new data structure called relaxed Fibonacci heaps for implementing priority queues on a RAM. Relaxed Fibonacci heaps support the operations find minimum, insert, decrease key and meld, each in O(1) worst case time and delete and delete min in O(log n) worst case time. Introduction The implementation of priority queues is a classical problem in data structures. Priority queues find ...

Quake Heaps: A Simple Alternative to Fibonacci Heaps

This note describes a data structure that has the same theoretical performance as Fibonacci heaps, supporting decrease-key operations in O(1) amortized time and delete-min operations in O(log n) amortized time. The data structure is simple to explain and analyze, and may be of pedagogical value.